Chaotic Binary Particle Swarm Optimization for Feature Selection using Logistic Map
نویسنده
چکیده
Feature selection is a useful technique for increasing classification accuracy. The primary objective is to remove irrelevant features in the feature space and identify relevant features. Binary particle swarm optimization (BPSO) has been applied successfully in solving feature selection problem. In this paper, chaotic binary particle swarm optimization (CBPSO) with logistic map for determining the inertia weight is used. The K-nearest neighbor (K-NN) method with leave-one-out cross-validation (LOOCV) serves as a classifier for evaluating classification accuracies. Experimental results indicate that the proposed method not only reduces the number of features, but also achieves higher classification accuracy than other methods.
منابع مشابه
Chaotic maps based on binary particle swarm optimization for feature selection
Feature selection is a useful pre-processing technique for solving classification problems. The challenge of solving the feature selection problem lies in applying evolutionary algorithms capable of handling the huge number of features typically involved. Generally, given classification data may contain useless, redundant or misleading features. To increase classification accuracy, the primary ...
متن کاملChaotic Particle Swarm Optimization with Mutation for Classification
In this paper, a chaotic particle swarm optimization with mutation-based classifier particle swarm optimization is proposed to classify patterns of different classes in the feature space. The introduced mutation operators and chaotic sequences allows us to overcome the problem of early convergence into a local minima associated with particle swarm optimization algorithms. That is, the mutation ...
متن کاملSuppression of Chaotic Behavior in Duffing-holmes System using Backstepping Controller Optimized by Unified Particle Swarm Optimization Algorithm
The nonlinear behavior analysis and chaos control for Duffing-Holmes chaotic system is discussed in the paper. In order to suppress the irregular chaotic motion, an optimal backstepping controller is designed. The backstepping method consists of parameters with positive values. The improper selection of the parameters leads to inappropriate responses or even may lead to instability of the syste...
متن کاملParticle Swarm Optimization with Chaotic Maps and Gaussian Mutation for Function Optimization
Particle swarm optimization (PSO) is a population-based stochastic optimization that has been widely applied to a variety of problems. However, it is easily trapped into the local optima and appears premature convergence during the search process. To address these problems, we propose a new particle swarm optimization by introducing chaotic maps (tent map and logistic map) and Gaussian mutation...
متن کاملFeature Selection Method with Proportionate Fitness Based Binary Particle Swarm Optimization
Particle swarm optimization(PSO) has been applied on feature selection with many improved results. Traditional PSO methods have some drawbacks when dealing with binary space, which may have negative effects on the selection result. In this paper, an algorithm based on fitness proportionate selection binary particle swarm optimization(FPSBPSO) will be discussed in detail aiming to overcome the p...
متن کامل